نتایج جستجو برای: linear operator equation

تعداد نتایج: 753184  

Journal: :bulletin of the iranian mathematical society 2014
masoud hajarian

in this work‎, ‎an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$‎ ‎and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$‎ ‎where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$‎, ‎$mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$‎, ‎$ma...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم پایه 1389

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

For a bounded linear operator on Hilbert space we define a sequence of the so-called weakly extremal vectors‎. ‎We study the properties of weakly extremal vectors and show that the orthogonality equation is valid for weakly extremal vectors‎. ‎Also we show that any quasinilpotent operator $T$ has an hypernoncyclic vector‎, ‎and so $T$ has a nontrivial hyperinvariant subspace‎.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه گیلان - دانشکده علوم پایه 1388

چکیده ندارد.

Journal: :Journal of Differential Equations 1969

Journal: :journal of mathematical modeling 2013
saeed karimi

in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and  $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$  is the unknown matrix. we present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

Journal: :bulletin of the iranian mathematical society 2015
r. eskandari f. mirzapour

for a bounded linear operator on hilbert space we define a sequence of the so-called weakly extremal vectors‎. ‎we study the properties of weakly extremal vectors and show that the orthogonality equation is valid for weakly extremal vectors‎. ‎also we show that any quasinilpotent operator $t$ has an hypernoncyclic vector‎, ‎and so $t$ has a nontrivial hyperinvariant subspace‎.

‎In this paper‎, ‎two iterative methods are constructed to solve the operator equation $ Lu=f $ where $L:Hrightarrow H $ is a bounded‎, ‎invertible and self-adjoint linear operator on a separable Hilbert space $ H $‎. ‎ By using the concept of frames of subspaces‎, ‎which is a generalization of frame theory‎, ‎we design some  algorithms based on Galerkin and Richardson methods‎, ‎and then we in...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید